minimal subset
英 [ˈmɪnɪməl ˈsʌbset]
美 [ˈmɪnɪməl ˈsʌbset]
网络 最小子集; 极小子集
双语例句
- For example, print directs full trace data to stderr, while minimal directs a subset of data for each tracepoint to in-memory buffers that can be captured to a file using the output option.
例如，print将所有跟踪数据定向到stderr，minimal将每个跟踪点的数据子集定向到内存缓冲区，然后又可以使用output选项将这些缓冲区中的数据捕捉到文件中。 - It is performed by the identification of the minimal subset of applications used by each functional segment, which covers at least the minimal required functionality.
这需要识别每个功能性组使用的最小应用程序子集，只覆盖必需的功能。 - You can, for example," strip down "a process to contain a minimal subset of its content by removing packages that contain elements of work that you do not want to perform.
比如，你可以通过删除包含你不希望进行的工作元素的包来“拆开”一个过程，使它只包含它的内容的最小子集。 - BusyBox: BusyBox is a multicall binary used to provide a minimal subset of POSIX-style commands and specialized functions.
BusyBox：BusyBox是一个多调用的二进制文件，它提供了POSIX式的命令和专用函数的最小子集。 - With this method, all minimal subset can be resolved and the computational complexity is less than solution from definition.
利用该方法能准确地求出信息系统中所有的最小子集，且计算量少于由定义来约简。 - Extracting Geometric Primitives Using a Genetic Algorithm Based on Minimal Subset
用基于最小子集的遗传算法提取基元 - The expansion of codebook min-ishes the minimal distortion in every subset and improves the quantization performance.
码书扩大造成每一子集最小失真减小从而提高了量化性能。 - According to these results, a method to find the minimal subset in the rough set theory is formed, by which, a NP problem in the rough set theory is resolved.
以此为基础，形成了粗糙集理论研究中求解最小子集的算法，使得原来的NP难题得以解决。 - Generally, the set of non-redundant strict minimal siphons is a much small subset of the set of strict minimal siphons in a Petri net, particularly in large-scale ones.
一般说来，非冗余严格极小信标是系统严格极小信标一个小的子集，尤其对于复杂系统的网模型。 - Central to this technique is the problem of searching for a reduct which is a minimal subset of information that has the same ability to classify data as when the full set of information is used.
而这种技术的核心问题是寻找一种最小缩减，即与原信息集合有相同的区分数据能力的最小的信息子集。 - According to a minimal subset of available features, information network like tree structure that shows relationship between input features and the target attributes is put forward in this paper to implement classification.
根据存在特征的最小子集，文章提出了建立类似树结构的输入属性和输出特征之间关系的信息网络来实现分类的方法。 - The heuristic algorithm of minimal feature subset selection is proved very efficient by theoretical analysis and experiment.
通过理论分析和实验，证明了该特征选取方法的高效性。 - Since finding a minimal subset of reduction is an NP-hard problem and evolution algorithm shows good performance in solving the combinatorial optimization problem, we present an algorithm of attribute reduction by using ant colony optimization.
由于寻找最小约简已经被证明是一个NP-Hard问题，而进化算法在求解复杂组合优化问题中获得成功并且表现出良好的性能。